Statistically-Hiding Quantum Bit Commitment from Approximable-Preimage-Size Quantum One-Way Function

نویسندگان

  • Takeshi Koshiba
  • Takanori Odaira
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Statistical Zero-Knowledge Arguments for NP Using Approximable-Preimage-Size One-Way Functions

A statistical zero knowledge argument for NP is a cryptographic primitive that allows a polynomial-time prover to convince another polynomial-time verifier of the validity of an NP statement. It is guaranteed that even an infinitely powerful verifier does not learn any additional information but the validity of the claim. Naor et al. [NOVY98] showed how to implement such a protocol using any on...

متن کامل

M ar 2 00 4 An Unconditionally Secure Quantum Bit Commitment Scheme

An unconditionally secure quantum bit commitment is proposed in this paper. we show that this scheme is statistically binding and perfectly concealing. The security of the protocol is based on the existence of quantum one-way functions by fundamental principles of quantum physics. As a conclusion of this paper, statistically binding and perfectly concealing quantum bit commitment schemes can be...

متن کامل

How to Convert a Flavor of Quantum Bit Commitment

In this paper we show how to convert a statistically binding but computationally concealing quantum bit commitment scheme into a computationally binding but statistically concealing scheme. For a security parameter n, the construction of the statistically concealing scheme requires O(n) executions of the statistically binding scheme. As a consequence, statistically concealing but computationall...

متن کامل

Converting the flavor of a quantum bit commitment

The results presented in the thesis show how to convert a statistically binding but computationally concealing quantum bit commitment scheme into a computationally binding but statistically concealing scheme. For a security parameter n, the construction of the statistically concealing scheme requires O(n) executions of the statistically binding scheme. As a consequence of the reduction, statist...

متن کامل

An Unconditionally Secure Quantum Bit Commitment Scheme ⋆

Bit commitment plays an important role in modern cryptography and is widely utilized in protocol design. In this paper, we propose an unconditionally secure quantum bit commitment scheme which is statistically binding and perfectly concealing. The security of this scheme is based on the existence of quantum one-way functions by fundamental principles of quantum physics. As a conclusion of this ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009